Lo-Keng Hua inequality and dynamic programming

A dynamic inequality generation scheme for polynomial programming

Hierarchies of semidefinite programs have been used to approximate or even solve polynomial programs. This approach rapidly becomes computationally expensive and is often tractable only for problems of small size. In this paper, we propose a dynamic inequality generation scheme to generate valid polynomial inequalities for general polynomial programs. When used iteratively, this scheme improves...

Extending the Quadrangle Inequality to Speed-Up Dynamic Programming

Proving that a function satisfies the quadrangle inequality is a powerful and elegant way to show that a dynamic programming algorithm to compute that function can be sped up by a factor of the input size. In this paper we consider two problems that do no fit in the usual general cases of functions that satisfy the quadrangle inequality but for which the proof of the quadrangle inequality still...

Fully fuzzy linear programming with inequality constraints

Fuzzy linear programming problem occur in many elds such as mathematical modeling, Control theory and Management sciences, etc. In this paper we focus on a kind of Linear Programming with fuzzy numbers and variables namely Fully Fuzzy Linear Programming (FFLP) problem, in which the constraints are in inequality forms. Then a new method is proposed to ne the fuzzy solution for solving (FFLP). Nu...

fully fuzzy linear programming with inequality constraints

fuzzy linear programming problem occur in many elds such as mathematical modeling, control theory and management sciences, etc. in this paper we focus on a kind of linear programming with fuzzy numbers and variables namely fully fuzzy linear programming (fflp) problem, in which the constraints are in inequality forms. then a new method is proposed to ne the fuzzy solution for solving (fflp). ...

A Programming Language For Lo alComputations in Graphs